Two acceleration mechanisms in verified global optimization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verified Global Optimization with Taylor Model based Range Bounders

Taylor models provide enclosures of functional dependencies by a polynomial and an interval remainder bound that scales with a high power of the domain width, allowing a far-reaching suppression of the dependency problem. For the application to range bounding, one observes that the resulting polynomials are more well-behaved than the original function; in fact, merely naively evaluating them in...

متن کامل

Long-term stability of the Tevatron by verified global optimization

The tools used to compute high-order transfer maps based on differential algebraic (DA) methods have recently been augmented by methods that also allow a rigorous computation of an interval bound for the remainder. In this paper we will show how such methods can also be used to determine rigorous bounds for the global extrema of functions in an efficient way. The method is used for the bounding...

متن کامل

A second-order pruning step for verified global optimization

We consider pruning steps used in a branch-and-bound algorithm for veri ed global optimization. A rst-order pruning step was given by Ratz using automatic computation of a rst-order slope tuple [21, 22]. In this paper, we introduce a second-order pruning step which is based on automatic computation of a second-order slope tuple. We add this second-order pruning step to the algorithm of Ratz. Fu...

متن کامل

A Formally Verified Generic Branching Algorithm for Global Optimization

This paper presents a formalization in higher-order logic of a generic algorithm that is used in automated strategies for solving global optimization problems. It is a generalization of numerical branch and bound algorithms that compute the minimum of a function on a given domain by recursively dividing the domain and computing estimates for the range of the function on each sub-domain. The cor...

متن کامل

Verified global optimization for estimating the parameters of nonlinear models

Nonlinear parameter estimation is usually achieved via the minimization of some possibly non-convex cost function. Interval analysis provides tools for the guaranteed characterization of the set of all global minimizers of such a cost function when a closed-form expression for the output of the model is available or when this output is obtained via the numerical solution of a set of ordinary di...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2007

ISSN: 0377-0427

DOI: 10.1016/j.cam.2005.08.032